Average Case Completeness

نویسنده

Yuri Gurevich

چکیده

We explain and advance Levin’s theory of average case completeness. In particular, we exhibit examples of problems complete in the average case and prove a limitation on the power of deterministic reductions. ∗J. Computer and System Sciences 42:3, June 1991, 346–398. †Partially supported by NSF grant DCR 85-03275.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Matrix Transformation Is Complete for the Average Case

In the theory of worst case complexity, NP completeness is used to establish that, for all practical purposes, the given NP problem is not decidable in polynomial time. In the theory of average case complexity, average case completeness is supposed to play the role of NP completeness. However, the average case reduction theory is still at an early stage, and only a few average case complete pro...

متن کامل

Assessment of the completeness of Volunteered Geographic Information focusing on building blocks data (Case Study: Tehran metropolis)

Open Street Map (OSM) is currently the largest collection of volunteered geographic data, widely used in many projects as an alternative to or integrated with authoritative data. However, the quality of these data has been one of the obstacles to the widely use of it. In this article, from among the elements related to the quality of volunteered geographic data, we have tried to examine the com...

متن کامل

ON COMPACTNESS AND G-COMPLETENESS IN FUZZY METRIC SPACES

In [Fuzzy Sets and Systems 27 (1988) 385-389], M. Grabiec in- troduced a notion of completeness for fuzzy metric spaces (in the sense of Kramosil and Michalek) that successfully used to obtain a fuzzy version of Ba- nachs contraction principle. According to the classical case, one can expect that a compact fuzzy metric space be complete in Grabiecs sense. We show here that this is not the case,...

متن کامل

Contents 1 Average - Case Computational Complexity Theory 1

NP-complete problems are generally thought of as being com-putationally intractable. However, NP-completeness is a worst-case concept. Indeed, some NP-complete problems are \easy on average," though some may not be. How is one to know whether an NP-complete problem is \diicult on average"? The theory of average-case computational complexity , initiated by Levin about ten years ago, is devoted t...

متن کامل